(Un)Stable Manifold Computation via Iterative Forward-Backward Runge-Kutta Type Methods
نویسندگان
چکیده
I present numerical methods for the computation of stable and unstable manifolds in autonomous dynamical systems. Through differentiation of the Lyapunov-Perron operator in [1], we find that the stable and unstable manifolds are boundary value problems on the original set of differential equation. This allows us to create a forward-backward approach for manifold computation, where we iteratively integrate one set of variables forward in time, and one set of variables backward in time. Error and stability of these methods is discussed.
منابع مشابه
Forward Symplectic Integrators for Solving Gravitational Few-Body Problems
We introduce a class of fourth order symplectic algorithms that are ideal for doing long time integration of gravitational few-body problems. These algorithms have only positive time steps, but require computing the force gradient in additional to the force. We demonstrate the efficiency of these Forward Symplectic Integrators by solving the circularly restricted three-body problem in the space...
متن کاملEmbedded Diagonally Implicit Runge - Kutta Algorithms on Parallel Computers
This paper investigates diagonally implicit Runge-Kutta methods in which the implicit relations can be solved in parallel and are singly diagonalimplicit on each processor. The algorithms are based on diagonally implicit iteration of fully implicit Runge-Kutta methods of high order. The iteration scheme is chosen in such a way that the resulting algorithm is ^(a)-stable or Z,(a)-stable with a e...
متن کاملHigh Order Runge { Kutta Methods on Manifolds
This paper presents a family of Runge{Kutta type integration schemes of arbitrarily high order for di erential equations evolving on manifolds. We prove that any classical Runge{Kutta method can be turned into an invariant method of the same order on a general homogeneous manifold, and present a family of algorithms that are relatively simple to implement.
متن کاملA Parallelizable Preconditioner for the Iterative Solution of Implicit Runge-kutta Type Methods
The main di culty in the implementation of most standard implicit Runge-Kutta (IRK) methods applied to (sti ) ordinary di erential equations (ODE's) is to e ciently solve the nonlinear system of equations. In this article we propose the use of a preconditioner whose decomposition cost for a parallel implementation is equivalent to the cost for the implicit Euler method. The preconditioner is ba...
متن کاملHigh Order Runge { Kutta Methods on Manifolds Hans
This paper presents a family of Runge{Kutta type integration schemes of arbitrarily high order for diierential equations evolving on manifolds. We prove that any classical Runge{Kutta method can be turned into an invariant method of the same order on a general homogeneous manifold, and present a family of algorithms that are relatively simple to implement.
متن کامل